Optimum Anytime Bounding for Constraint Optimization Problems
نویسندگان
چکیده
In this paper, we consider Constraint Optimization Problems in a Resource-Bounded context. We observe that both exact and approximate methods produce only an anytime upper bound of the optimum (in case of minimization). No lower bound, and thus no quality is available at run time. For a meta-reasoning system, it is difficult to reason on the basis of a so poor piece of information. Therefore, we discuss some ways of producing an anytime lower bound. In the Valued Constraint Saris]action Problem framework, we develop some of them, based on the complete solving of problem simplifications, and we present experimental results.
منابع مشابه
Quality Guarantees on k-Optimal Solutions for Distributed Constraint Optimization Problems
A distributed constraint optimization problem (DCOP) is a formalism that captures the rewards and costs of local interactions within a team of agents. Because complete algorithms to solve DCOPs are unsuitable for some dynamic or anytime domains, researchers have explored incomplete DCOP algorithms that result in locally optimal solutions. One type of categorization of such algorithms, and the s...
متن کاملSolving Constraint Optimization Problems in Anytime Contexts
This paper presents a new hybrid method for solving constraint optimization problems in anytime contexts. Discrete optimization problems are modelled as Valued CSP. Our method (VNS/LDS+CP) combines a Variable Neighborhood Search and Limited Discrepancy Search with Constraint Propagation to efficiently guide the search. Experiments on the CELAR benchmarks demonstrate significant improvements ove...
متن کاملBounding the Optimum of Constraint Optimization Problems
Solving constraint optimization problems is computationally so expensive that it is often impossible to provide a guaranteed optimal solution, either when the problem is too large, or when time is bounded. In these cases, local search algorithms usually provide good solutions. However, and even if an optimality proof is unreachable, it is often desirable to have some guarantee on the quality of...
متن کاملAnytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP
We propose Hybrid Best First Search (HBFS), a search strategy for optimization problems that combines Best First Search (BFS) and Depth First Search (DFS). Like BFS, HBFS provides an anytime global lower bound on the optimum, while also providing anytime upper bounds, like DFS. Hence, it provides feedback on the progress of search and solution quality in the form of an optimality gap. In additi...
متن کاملA New Introduction to Global Optimization over Polyhedrons
For some kinds of linearly constrained optimization problems with unique optimal solution, such as linear and convex problems, the single local optimum is also global. However, there are a broad variety of problems in which the property of unique solution cannot be simply postulated or verified. The paper presents an effective approach for the global linearly constrained optimization problem wi...
متن کامل